Tight bounds on sparse perturbations of Markov Chains∗
نویسندگان
چکیده
What influence can be exerted by one or a few nodes in the consensus or stationary distribution reached by a global network? We address this general question regarding the sensitivity of the invariant probability distribution of an irreducible row-stochastic matrix to the perturbation of a few of its rows, and provide tight bounds on the ∞-norm of the perturbation that can be computed in polynomial time.
منابع مشابه
Empirical Bayes Estimation in Nonstationary Markov chains
Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical Bayes estimators for the transition probability matrix of a finite nonstationary Markov chain. The data are assumed to be of a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملUniform Stability of Markov Chains*
By deriving a new set of tight perturbation bounds, it is shown that all stationary probabilities of a finite irreducible Markov chain react essentially in the same way to perturbations in the transition probabilities. In particular, if at least one stationary probability is insensitive in a relative sense, then all stationary probabilities must be insensitive in an absolute sense. New measures...
متن کاملReconstruction Threshold for the Hardcore Model
In this paper we consider the reconstruction problem on the tree for the hardcore model. We determine new bounds for the non-reconstruction regime on the k-regular tree showing non-reconstruction when λ < (ln 2 − o(1)) ln k 2 ln ln k improving the previous best bound of λ < e − 1. This is almost tight as reconstruction is known to hold when λ > (e+ o(1)) ln k. We discuss the relationship for fi...
متن کاملPerturbation bounds and degree of imprecision for uniquely convergent imprecise Markov chains
The effect of perturbations of parameters for uniquely convergent imprecise Markov chains is studied. We provide the maximal distance between the distributions of original and perturbed chain and maximal degree of imprecision, given the imprecision of the initial distribution. The bounds on the errors and degrees of imprecision are found for the distributions at finite time steps, and for the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013